Restarting Automata and Variants of j-Monotonicity
نویسندگان
چکیده
In the literature various notions of (non-) monotonicity of restarting automata have been studied. Here we introduce two new variants of (non-) monotonicity for restarting automata and for two-way restarting automata: left (non-) monotonicity and right-left (non-) monotonicity. It is shown that for the various types of deterministic and nondeterministic (two-way) restarting automata without auxiliary symbols, these notions yield infinite hierarchies. In addition, we compare the various hierarchies to each other.
منابع مشابه
Degrees of (Non)Monotonicity of RRW-Automata
We introduce and study the notion of j-monotonicity of RRand RRW -automata (special types of restarting automata without working symbols). We show that the j-monotonicity can be considered as a degree of non-context-freeness of languages recognized by RRW -automata and RR-automata. 1-monotonic RRW -automata recognize a subset of the class of context-free languages. For j > 1, the j-monotonic RR...
متن کاملHierarchies of weakly monotone restarting automata
It is known that the weakly monotone restarting automata accept exactly the growing contextsensitive langauges. We introduce a measure on the degree of weak monotonicity and show that the language classes obtained in this way form strict hierarchies for the various types of deterministic and nondeterministic restarting automata without auxiliary symbols.
متن کاملCut Hierarchies for Restarting Automata and Marcus t-Contextual Grammars
t-contextual grammars with regular selection are considered for which all t insertions are performed in the same neighbourhood. The languages generated by these grammars are accepted by restarting automata with cut-index t. Here the classes of languages accepted by certain variants of restarting automata with limited cut-index are studied.
متن کاملRestarting automata and pre x-rewriting systems
Jan car et al (1995) developed the restarting automaton as a formal model of certain syn-tactical aspects of natural languages. Here we mainly concentrate on the deterministic version of the restarting automaton and its variants, establishing some inclusion results for the class of Church-Rosser languages. In addition, it is shown that there is a close correspondence between various classes of ...
متن کاملOn Restarting Automata with Rewriting
Motivated by natural language analysis we introduce restarting automata with rewriting. They are acceptors on the one hand, and (special) regulated rewriting systems on the other hand. The computation of a restarting automaton proceeds in cycles: in each cycle, a bounded substring of the input word is rewritten by a shorter string, and the computation restarts on the arising shorter word. We sh...
متن کامل